25 years proof of the Kneser conjecture The advent of topological combinatorics

نویسنده

  • Mark de Longueville
چکیده

With this article I want to take the opportunity to sketch the development of topological proofs in discrete mathematics beginning with the proof of the Kneser conjecture about 25 years ago, which eventually led to a new discipline: topological combinatorics. In the beginning of the twentieth century the discipline of combinatorial topology already made use of combinatorial concepts in topology, finally leading to the emergence of algebraic topology. Meanwhile, discrete mathematics did not make much use of techniques from (algebraic) topology until the seminal proof of the Kneser conjecture. This situation was going to change in an unexpected and fascinating way. The essence of topological combinatorics can be characterized by a scheme that many proofs in this field pursue. If we want to solve a combinatorial problem by topological means we carry out the following steps.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Brief Glimpse of Topological Combinatorics

Lovazs’ proof of the Kneser Conjecture presents a beautiful application of Borsuk-Ulam Theorem, a purely topological result, to a combinatorial problem on finite graphs. Moreover, Kneser-Lovasz Theorem is far from being the only case in which a combinatorial problem admits as a solution that uses topological techniques. It is rather surprising that the study of continuous maps would yield elega...

متن کامل

Symmetries of the Stable Kneser Graphs

It is well known that the automorphism group of the Kneser graph KGn,k is the symmetric group on n letters. For n ≥ 2k + 1, k ≥ 2, we prove that the automorphism group of the stable Kneser graph SGn,k is the dihedral group of order 2n. Let [n] := [1, 2, 3, . . . , n]. For each n ≥ 2k, n, k ∈ {1, 2, 3, . . .}, the Kneser graph KGn,k has as vertices the k-subsets of [n] with edges defined by disj...

متن کامل

عدد تناوبی گراف‌ها

In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem. 

متن کامل

A short proof of the maximum conjecture in CR dimension one

In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...

متن کامل

Generalized Kneser Coloring Theorems with Combinatorial Proofs

The Kneser conjecture (1955) was proved by Lovász (1978) using the Borsuk-Ulam theorem; all subsequent proofs, extensions and generalizations also relied on Algebraic Topology results, namely the Borsuk-Ulam theorem and its extensions. Only in 2000, Matoušek provided the first combinatorial proof of the Kneser conjecture. Here we provide a hypergraph coloring theorem, with a combinatorial proof...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004